On the asymptotic existence of cocyclic Hadamard matrices
نویسندگان
چکیده
Let q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order 210+tq whenever t ≥ 8b log2(q−1) 10 c. We also show that if the binary expansion of q contains N ones, then there is a cocyclic Hadamard matrix of order 24N−2q.
منابع مشابه
Classifying cocyclic Butson Hadamard matrices
We classify all the cocyclic Butson Hadamard matrices BH(n, p) of order n over the pth roots of unity for an odd prime p and np ≤ 100. That is, we compile a list of matrices such that any cocyclic BH(n, p) for these n, p is equivalent to exactly one element in the list. Our approach encompasses non-existence results and computational machinery for Butson and generalized Hadamard matrices that a...
متن کاملGroup actions on Hadamard matrices
Faculty of Arts Mathematics Department Master of Literature by Padraig Ó Catháin Hadamard matrices are an important item of study in combinatorial design theory. In this thesis, we explore the theory of cocyclic development of Hadamard matrices in terms of regular group actions on the expanded design. To this end a general theory of both group development and cocyclic development is formulated....
متن کاملThe cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is describe...
متن کاملDifference sets and doubly transitive actions on Hadamard matrices
Non-affine groups acting doubly transitively on a Hadamard matrix have been classified by Ito. Implicit in this work is a list of Hadamard matrices with non-affine doubly transitive automorphism group. We give this list explicitly, in the process settling an old research problem of Ito and Leon. We then use our classification to show that the only cocyclic Hadamard matrices developed form a dif...
متن کاملA Genetic Algorithm for Cocyclic Hadamard Matrices
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, the algorithm may be easily extended to cover any group. Some executions and examples are also included, with aid of Mathematica 4.0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 116 شماره
صفحات -
تاریخ انتشار 2009